翻訳と辞書 Words near each other ・ Smoke deflectors ・ Smoke detector ・ Smoke discharger ・ Smoke DZA ・ Smoke DZA discography ・ SMKBUD4 ・ SMKI ・ SMKKID ・ SML ・ SML Isuzu ・ SMLC ・ Smlednik ・ SMM ・ SMMCore ・ SMN ・ Smn theorem ・ SMN1 ・ SMN2 ・ SMNC ・ SMO ・ Smoaks, South Carolina ・ SMOC ・ SMOC2 ・ Smochan ・ Smochevo Cove ・ Smock ・ Smock Alley Theatre ・ Smock Historic District ・ Smock mill ・ Smock Parachutist DPM Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Smn theorem ： ウィキペディア英語版 Smn theorem In computability theory the ''s''''mn'' theorem, (also called the translation lemma, parameter theorem, or parameterization theorem) is a basic result about programming languages (and, more generally, Gödel numberings of the computable functions) (Soare 1987, Rogers 1967). It was first proved by Stephen Cole Kleene (Kleene 1943). In practical terms, the theorem says that for a given programming language and positive integers ''m'' and ''n'', there is a particular algorithm that operates on the source code of programs with ''m'' + ''n'' free variables. This algorithm produces source code that effectively substitutes ''m'' given values for the first ''m'' free variables in the program and leaves the rest free. ==Details== The basic form of the theorem applies to functions of two arguments (Nies 2009, p. 6). Given a Gödel numbering $\backslash varphi$ of recursive functions, there is a primitive recursive function ''s'' of two arguments with the following property: for every Gödel number ''p'' of a partial computable function ''f'' with two arguments, the expressions $\backslash varphi\_(y)$ and $f(x,y)$ are defined for the same combinations of natural numbers ''x'' and ''y'', and their values are equal for any such combination. In other words, the following extensional equality of functions holds for every ''x'': :$\backslash varphi\_\; \backslash simeq\; \backslash lambda\; y.\backslash varphi\_p(x,y).\backslash ,$ More generally, for any ''m'', ''n'' > 0, there exists a primitive recursive function $s^m\_n$ of ''m'' + 1 arguments that behaves as follows: for every Gödel number ''p'' of a partial computable function with ''m'' + ''n'' arguments, and all values of ''x''1,…,''x''''m'': : $\backslash varphi\_\; \backslash simeq\; \backslash lambda\; y\_1,\backslash dots,y\_n.\backslash varphi\_p(x\_1,\backslash dots,x\_m,y\_1,\backslash dots,y\_n).\backslash ,$ The function ''s'' described above can be taken to be $s^1\_1$. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Smn theorem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.